منابع مشابه
Typed vs. Untyped Realizability
We study the domain-theoretic semantics of a Church-style typed λ-calculus with constructors, pattern matching and recursion, and show that it is closely related to the semantics of its untyped counterpart. The motivation for this study comes from program extraction from proofs via realizability where one has the choice of extracting typed or untyped terms from proofs. Our result shows that und...
متن کاملTyped Processes in Untyped Contexts
S is a print spooler serving requests from a private channel s that it communicates to its clients via the public channel d. C is one such client, that receives s and uses it to print the job j. While the intention of the specification is clear, reasoning on its properties is subtler. For instance, given the initial configuration S |C, can we prove that the jobs sent by C are eventually receive...
متن کاملMatching typed and untyped realizability ( Extended abstract )
Realizability interpretations of logics are given by saying what it means for computational objects of some kind to realize logical formulae. The computational objects in question might be drawn from an untyped universe of computation, such as a partial combinatory algebra, or they might be typed objects such as terms of a PCF-style programming language. In some instances, one can show that a p...
متن کاملReasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, case-expressions, seq, and recursive types. The typed language is a subset of the untyped language. Normal-order reduction is defined for the untyped language. Since there are less typed contexts the typed contextual pre...
متن کاملFrom Untyped to Polymorphically Typed Objects in Mathematical Web Services
OpenMath is a widely recognised approach to the semantic markup of mathematics that is often used for communication between OpenMath compliant systems. The Aldor language has a sophisticated category-based type system that was specifically developed for the purpose of modelling mathematical structures, while the system itself supports the creation of small-footprint applications suitable for de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1998
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s002360050135